The anti-field-descent method

نویسندگان

  • Ka Hin Leung
  • Bernhard Schmidt
چکیده

The essential fact behind the so-called field-descent method is that certain cyclotomic integers necessarily are contained in relatively small fields and thus must have relatively small complex modulus. In this paper, we develop a method which reveals a complementary phenomenon: certain cyclotomic integers cannot be contained in relatively small fields and thus must have relatively large complex modulus. This method, in particular, yields progress towards the circulant Hadamard matrix conjecture. In fact, we show that such matrices give rise to certain “twisted cyclotomic integers” which often have small complex modulus, but are not contained in small fields. Hence our “anti-field-descent” method provides new necessary conditions for the existence of circulant Hadamard matrices. The application of the new conditions to previously open cases of Barker sequences shows that there is no Barker sequence of length ` with 13 < ` ≤ 4 · 1033. Furthermore, 229,682 of the 237,807 known open cases of the Barker sequence conjecture are ruled out. ∗Ka Hin Leung’s research is supported by grant No. R-146-000-209-112, Ministry of Education, Singapore.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The effect of time interval between descent of the Quran and commentator on the commentary

The Holy Quran was descended from Almighty Allah to the Holy Prophet (AS) about the last 14 centuries and there has been a time interval between descent of the Quran and its existing readers and commentators. This Question is posed whether this time interval between descent of the Quran and commentator will effect on verses understanding and their commentary or not? As one of commentary princip...

متن کامل

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

متن کامل

An eigenvalue study on the sufficient descent property of a‎ ‎modified Polak-Ribière-Polyak conjugate gradient method

‎Based on an eigenvalue analysis‎, ‎a new proof for the sufficient‎ ‎descent property of the modified Polak-Ribière-Polyak conjugate‎ ‎gradient method proposed by Yu et al‎. ‎is presented‎.

متن کامل

Low Complexity and High speed in Leading DCD ERLS Algorithm

Adaptive algorithms lead to adjust the system coefficients based on the measured data. This paper presents a dichotomous coordinate descent method to reduce the computational complexity and to improve the tracking ability based on the variable forgetting factor when there are a lot of changes in the system. Vedic mathematics is used to implement the multiplier and the divider in the VFF equatio...

متن کامل

Hybrid steepest-descent method with sequential and functional errors in Banach space

Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 139  شماره 

صفحات  -

تاریخ انتشار 2016